A pr 2 01 1 Random input helps searching predecessors
نویسنده
چکیده
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only n bits of memory, for any constant δ > 0. The input keys are random wrt a wider class of the well studied and practically important class of (f1, f2)-smooth distributions introduced in [3]. It achieves O(1) whp amortized time. Its worst-case time is O( √ logn log logn ). Also, we prove whp O(log log log n) time using only n 1 log log n = n bits. Finally, we show whp O(log log n) time using O(n) space.
منابع مشابه
Random input helps searching predecessors
We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only n bits of memory, for any constant δ > 0. The input keys are random wrt a wider class of the well studied and practically important class of (f1, f2)-smooth distributions introduced in [3]. It achieves O(1) whp amortized time. Its worst-case time is O( √ logn log logn ). Also, we prove whp O(log lo...
متن کاملThe height of a binary search tree: the limiting distribution perspective
Wojciech Szpankowskit Department of Computer Science Purdue University W. Lafayette, IN 47907 U.s.A. spa~cs.purdue. cdu We study the height of the binary search tree the most fundamental data structure used for searching. We assume that the binary search tree is built from a random permutation of n elements. Under this assumption, we study the limiting distribution of the height as n -4 00. We ...
متن کاملar X iv : 1 11 0 . 19 12 v 1 [ m at h . PR ] 1 0 O ct 2 01 1 Emergent Structures in Large Networks
We consider a large class of exponential random graph models and prove the existence of a region of parameter space corresponding to multipartite structure, separated by a phase transition from a region of disordered graphs. 1 Department of Mathematics University of Minnesota Minneapolis, MN 55455 2 Department of Mathematics University of Texas Austin, TX 78712 1
متن کاملCapacity Achieving Distributions & Information Lossless Randomized Strategies for Feedback Channels with Memory: The LQG Theory of Directed Information-Part II
A methodology is developed to realized optimal channel input conditional distributions, which maximize the finite-time horizon directed information, for channels with memory and feedback, by information lossless randomized strategies. The methodology is applied to general Time-Varying Multiple Input Multiple Output (MIMO) Gaussian Linear Channel Models (G-LCMs) with memory, subject to average t...
متن کاملRandomness-optimal oblivious sampling
We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any α > 0, it uses (1 +α)(m+ log γ−1) random bits to output d = poly( −1, log γ−1,m) sample points z1, . . . , zd ∈ {0, 1} such that for any function f : {0, 1} → [0, 1], Pr [ ∣∣∣ 1 d ∑di=1f(zi)−Ef ∣∣∣ ≤ ] ≥ 1− γ. Our proof is based on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011